An Experimental Analysis of Bottleneck-Centered Opportunistic Scheduling
نویسنده
چکیده
Bottleneck-centered, opportunistic scheduling is an effective problem solving paradigm based on a fundamental Analyze-Focus-Decide cycle. Opportunistic schedulers have shown better overall performance than other scheduling systems adopting different paradigms. However. in order to make more significant progress, we need to better understand how the different phases of the opportunistic cycle interact during problem solving. This paper reports an extensive analysis of a specific embodiment of the opportunistic scheduling paradigm, the Conflict Partition Scheduling procedure. By analyzing the role of each phase of CPS, proposing variations and anticipating expected effects on the performance of the algorithm, we aim to develop a better understanding of the importance of the different phases and of their interactions. The hypotheses on the performance of CPS are then verified in an experimental analysis. The results of this study provide hard evidence that supports the fundamental assumptions made by opportunistic scheduling.
منابع مشابه
On the Utility of Bottleneck Reasoning for Scheduling
The design of better schedulers requires a deeper understanding of each component technique and of their interactions. Although widely accepted in practice, bottleneck reasoning for scheduling has not yet been sufficiently validated, either formally or empirically. This paper reports an empirical analysis of the heuristic information used by bottleneck-centered, opportunistic scheduling systems...
متن کاملThe MICRO-BOSS Scheduling System: Current Status and Future Efforts
1Over the past few years, several approaches to scheduling have been proposed that attempt to reduce tardiness and inventory costs by opportunistically (i.e. dynamically) combining resource-centered perspective to schedule bottleneck resources, and a job-centered perspective to schedule non-bottleneck operations on a job by job basis. Rather than relying on their initial bottleneck analysis, th...
متن کاملMicro-Boss: Dual-use ARPI scheduling technology helps improve manufacturing performance
In complex, large-scale domains such as military transportation or manufacturing, traditional scheduling technologies often prove inadequate because they rely on rigid and oversimplified models. These models cannot capture critical domain constraints, preferences, or objectives. They provide little or no support for dynamic schedule revisions necessary to react to contingencies (for example, ch...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993